baobabLUNA : the solution space of sorting by reversals
نویسندگان
چکیده
منابع مشابه
baobabLUNA: the solution space of sorting by reversals
SUMMARY Computing the reversal distance and searching for an optimal sequence of reversals to transform a unichromosomal genome into another are useful algorithmic tools to analyse real evolutionary scenarios. Currently, these problems can be solved by at least two available softwares, the prominent of which are GRAPPA and GRIMM. However, the number of different optimal sequences is usually hug...
متن کاملThe Solution Space of Sorting by Reversals
In comparative genomics, algorithms that sort permutations by reversals are often used to propose evolutionary scenarios of large scale genomic mutations between species. One of the main problems of such methods is that they give one solution while the number of optimal solutions is huge, with no criteria to discriminate among them. Bergeron et al. [4] started to give some structure to the set ...
متن کاملExploring the Solution Space of Sorting by Reversals: A New Approach
Analysing genome rearrangements is a problem from the vast domain of comparative genomics and computational biology. Several studies have shown that closely related species have essentially the same set of genes however their gene orders differ. The differences in the gene order are the results of various large-scale evolutionary events of which reversal is the most common rearrangement event. ...
متن کاملSorting by Prefix Reversals
The pancake problem, which has attracted considerable attention, concerns the number of prefix reversals needed to sort the elements of an arbitrary permutation. The number of prefix reversals to sort permutations is also the diameter of the often studied n-dimensional Pancake network. We consider restricted pancake problem, when only k of the possible n− 1 prefix reversals are allowed.
متن کاملSorting by reversals
One of the most studied problems in the field of computational biology is the string matching problem. Much of the reasearch has focused on developing efficient algorithms for transforming one string into another by minimizing the number of steps. The biological motivation for this problem comes from the fact that DNA sequences get transformed by a series of basic operations such as mutations, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2009
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btp285